Disjoint crossings, positive speed and deviation estimates for first passage percolation
نویسنده
چکیده
Consider bond percolation on the square latticeZ where each edge is independently open with probability p. For some positive constants p0 ∈ (0, 1), 1 and 2, the following holds: if p > p0, then with probability at least 1− 1 n4 there are at least 2n logn disjoint open left-right crossings in Bn := [0, n] 2 each having length at most 2n, for all n ≥ 2. Using the proof of the above, we obtain positive speed for first passage percolation with independent and identically distributed edge passage times {t(ei)}i satisfying E (log t(e1)) + < ∞; namely, lim supn Tpl(0,n) n ≤ Q a.s. for some constant Q < ∞, where Tpl(0, n) denotes the minimum passage time from the point (0, 0) to the line x = n taken over all paths contained in Bn. Finally, we also obtain corresponding deviation estimates for nonidentical passage times satisfying infiP(t(ei) = 0) > 2 3 .
منابع مشابه
Construction of a Short Path in High-dimensional First Passage Percolation
For first passage percolation in Zd with large d, we construct a path connecting the origin to {x1 = 1}, whose passage time has optimal order log d/d. Besides, an improved lower bound for the "diagonal" speed of the cluster combined with a result by Dhar (1988) shows that the limiting shape in FPP with exponential passage times (and thus that of Eden model) is not the euclidian ball in dimensio...
متن کاملFirst passage percolation in Euclidean space and on random tessellations
There are various models of first passage percolation (FPP) in R. We want to start a very general study of this topic. To this end we generalize the first passage percolation model on the lattice Z to R and adapt the results of [Boi90] to prove a shape theorem for ergodic random pseudometrics on R. A natural application of this result will be the study of FPP on random tessellations where a flu...
متن کاملSign changes as a universal concept in first-passage-time calculations.
First-passage-time problems are ubiquitous across many fields of study, including transport processes in semiconductors and biological synapses, evolutionary game theory and percolation. Despite their prominence, first-passage-time calculations have proven to be particularly challenging. Analytical results to date have often been obtained under strong conditions, leaving most of the exploration...
متن کاملFirst passage percolation on Z – a simulation study
First passage percolation on Z2 is a model for describing the spread of an infection on the sites of the square lattice. The infection is spread via nearest neighbor sites and the time dynamic is specified by random passage times attached to the edges. In this paper, the speed of the growth and the shape of the infected set is studied by aid of large-scale computer simulations, with focus on co...
متن کاملCoexistence in Two-type First-passage Percolation Models by Olivier Garet
We study the problem of coexistence in a two-type competition model governed by first-passage percolation on Zd or on the infinite cluster in Bernoulli percolation. We prove for a large class of ergodic stationary passage times that for distinct points x, y ∈ Zd , there is a strictly positive probability that {z ∈ Zd ;d(y, z) < d(x, z)} and {z ∈ Zd ;d(y, z) > d(x, z)} are both infinite sets. We...
متن کامل